-
1 two-stack parser
Большой англо-русский и русско-английский словарь > two-stack parser
-
2 two-stack parser
Вычислительная техника: двухстековый синтаксический анализатор, двухмагазинный анализатор -
3 two-stack parser
English-Russian dictionary of computer science and programming > two-stack parser
-
4 parser
программа синтаксического анализа, синтаксический анализатор;
программа грамматического разбора deterministic parser LR parser predictive parser right-to-left parser shift-reduce parser two-stack parser( компьютерное) синтаксический анализатор;
анализатор parser вчт. анализатор -
5 parser
программа синтаксического анализа, синтаксический анализатор; программа грамматического разбора- LR parser
- predictive parser
- right-to-left parser
- shift-reduce parser
- two-stack parserEnglish-Russian dictionary of computer science and programming > parser
-
6 двухстековый синтаксический анализатор
Большой англо-русский и русско-английский словарь > двухстековый синтаксический анализатор
См. также в других словарях:
LL parser — An LL parser is a top down parser for a subset of the context free grammars. It parses the input from Left to right, and constructs a Leftmost derivation of the sentence (hence LL, compared with LR parser). The class of grammars which are… … Wikipedia
LR parser — In computer science, an LR parser is a parser for context free grammars that reads input from Left to right and produces a Rightmost derivation. The term LR( k ) parser is also used; here the k refers to the number of unconsumed look ahead input… … Wikipedia
GLR parser — In computer science, a GLR parser ( Generalized Left to right Rightmost derivation parser ) is an extension of an LR parser algorithm to handle nondeterministic and ambiguous grammars. First described in a 1986 paper by Masaru Tomita, it has also … Wikipedia
Operator-precedence parser — An operator precedence parser is a bottom up parser that interprets an operator precedence grammar. For example, most calculators use operator precedence parsers to convert from the human readable infix notation with order of operations format… … Wikipedia
Lookahead — is a tool in algorithms for looking ahead a few more input items before making a cost effective decision at one stage of the algorithm. Lookahead vs. Lazy evaluation This is in contrast to another technique called lazy evaluation that delays the… … Wikipedia
Parsing table — A parsing table is the part of a parser that makes decisions about how to treat input tokens in compiler development.: This page is about LR parsing tables, there are also LL parsing tables which are substantially different. Overview A parsing… … Wikipedia
TCP Offload Engine — or TOE is a technology used in network interface cards to offload processing of the entire TCP/IP stack to the network controller. It is primarily used with high speed network interfaces, such as gigabit Ethernet and 10 gigabit Ethernet, where… … Wikipedia
C++0x — is the planned new standard for the C++ programming language. It is intended to replace the existing C++ standard, ISO/IEC 14882, which was published in 1998 and updated in 2003. These predecessors are informally known as C++98 and C++03. The new … Wikipedia
Markdown — is a lightweight markup language, originally created by John Gruber and Aaron Swartz allowing people to write using an easy to read, easy to write plain text format, then convert it to structurally valid XHTML (or HTML) .[1] The language takes… … Wikipedia
XML — Infobox file format name = Extensible Markup Language icon = logo = extension = .xml mime = application/xml, text/xml (deprecated) type code = uniform type = public.xml magic = owner = World Wide Web Consortium genre = Markup language container… … Wikipedia
GNU Compiler Collection — Cc1 redirects here. For other uses of CC1 or CC 1, see CC1 (disambiguation). GNU Compiler Collection Developer(s) GNU Project Initial release May 23, 1987 ( … Wikipedia
